-
1 теорема отсчётов
теорема отсчётов
теорема о дискретном представлении
Теорема гласит: любой непрерывный сигнал с ограниченным спектром может быть восстановлен из дискретной последовательности равностоящих его отсчётов при условии, что имеется не менее двух отсчётов на период самой высокочастотной составляющей этого сигнала
[ http://slovarionline.ru/anglo_russkiy_slovar_neftegazovoy_promyishlennosti/]Тематики
Синонимы
EN
Русско-английский словарь нормативно-технической терминологии > теорема отсчётов
См. также в других словарях:
Cardinal number — This article describes cardinal numbers in mathematics. For cardinals in linguistics, see Names of numbers in English. In mathematics, cardinal numbers, or cardinals for short, are generalized numbers used to measure the cardinality (size) of… … Wikipedia
Cardinal assignment — In set theory, the concept of cardinality is significantly developable without recourse to actually defining cardinal numbers as objects in theory itself (this is in fact a viewpoint taken by Frege; Frege cardinals are basically equivalence… … Wikipedia
Nyquist–Shannon sampling theorem — Fig.1: Hypothetical spectrum of a bandlimited signal as a function of frequency The Nyquist–Shannon sampling theorem, after Harry Nyquist and Claude Shannon, is a fundamental result in the field of information theory, in particular… … Wikipedia
Arrow's impossibility theorem — In social choice theory, Arrow’s impossibility theorem, the General Possibility Theorem, or Arrow’s paradox, states that, when voters have three or more distinct alternatives (options), no voting system can convert the ranked preferences of… … Wikipedia
De Bruijn–Erdős theorem (graph theory) — This article is about coloring infinite graphs. For the number of lines determined by a finite set of points, see De Bruijn–Erdős theorem (incidence geometry). In graph theory, the De Bruijn–Erdős theorem, proved by Nicolaas Govert de Bruijn and… … Wikipedia
König's theorem (set theory) — For other uses, see König s theorem. In set theory, König s theorem (named after the Hungarian mathematician Gyula König) colloquially states that if the axiom of choice holds, I is a set, mi and ni are cardinal numbers for every i in I , and m i … Wikipedia
Easton's theorem — In set theory, Easton s theorem is a result on the possible cardinal numbers of powersets. W. B. harvtxt|Easton|1970 (extending a result of Robert M. Solovay) showed via forcing that : kappa < operatorname{cf}(2^kappa),and, for kappale lambda,,… … Wikipedia
Morley's categoricity theorem — Vaught s test redirects here. Not to be confused with the Tarski–Vaught test. Categorical theory redirects here. Not to be confused with Category Theory. In model theory, a branch of mathematical logic, a theory is κ categorical (or categorical… … Wikipedia
Borel determinacy theorem — In descriptive set theory, the Borel determinacy theorem shows that any Gale Stewart game whose winning set is a Borel set is determined, meaning that one of the two players will have a winning strategy for the game. It was proved by Donald A.… … Wikipedia
Weakly compact cardinal — In mathematics, a weakly compact cardinal is a certain kind of cardinal number introduced by harvtxt|Erdös|Tarski|1961; weakly compact cardinals are large cardinals, meaning that their existence can neither be proven nor disproven from the… … Wikipedia
Large cardinal property — In the mathematical field of set theory, a large cardinal property is a certain kind of property of transfinite cardinal numbers. Cardinals with such properties are, as the name suggests, generally very large (for example, bigger than aleph zero … Wikipedia